Worst-case complexity - PDFSEARCH.IO - Document Search Engine

Worst-case complexity
Results: 44

#	Item
11	Exercise 7: Lost in complexity Task 1: Why is everything so hard?!? In this exercise, we always consider connected, simple, weighted graphs G = (V, E, W ), restrict message size to O(log n) bits, and assess worst-case ro Add to Reading List Source URL: resources.mpi-inf.mpg.de Language: English - Date: 2014-12-02 10:37:59 Combinatorial optimization Binary arithmetic Binary logarithm Calculus Logarithms Cut AanderaaKarpRosenberg conjecture Planar separator theorem
12	CS261: A Second Course in Algorithms Lecture #19: Beating Brute-Force Search∗ Tim Roughgarden† March 8, 2016 A popular myth is that, for N P -hard problems, there are no algorithms with worst-case running time better Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-03-15 10:47:56 NP-complete problems Computational complexity theory Analysis of algorithms Operations research NP-hard problems Vertex cover Travelling salesman problem Dynamic programming Parameterized complexity Independent set Algorithm 2-satisfiability
13	Computing Fundamentals Salvatore Filippone 2012–2013 Add to Reading List Source URL: people.uniroma2.it Language: English - Date: 2014-09-23 08:12:56 Analysis of algorithms Computational complexity theory Best worst and average case Time complexity Algorithm Fast Fourier transform Big O notation Average-case complexity Sorting algorithm
14	Parameterized Average-Case Complexity of the Hypervolume Indicator Karl Bringmann Tobias Friedrich Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:45:47 Analysis of algorithms Worst-case complexity Parameterized complexity P versus NP problem
15	Computing Fundamentals Salvatore Filippone 2013–2014 Add to Reading List Source URL: people.uniroma2.it Language: English - Date: 2014-09-23 08:13:16 Computational complexity theory Analysis of algorithms Best worst and average case Time complexity Algorithm Fast Fourier transform Big O notation Average-case complexity Sorting algorithm
16	Fault Tolerant External Memory Algorithms Gerth Stølting Brodal1 , Allan Grønlund Jørgensen1,? , and Thomas Mølhave1,? BRICS, MADALGO?? , Department of Computer Science, Aarhus University, Denmark. {gerth,jallan,thom Add to Reading List Source URL: users.cs.duke.edu Language: English - Date: 2015-07-24 06:57:56 Analysis of algorithms Time complexity Sorting algorithm Algorithm Randomized algorithm NC Big O notation Best worst and average case B-tree Soft heap Oblivious data structure
17	Modeling Real-World Data Sets Susanne Albers Department of Computer Science, Technische Universität München Boltzmannstr. 3, 85748 Garching, Germany Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2015-06-11 03:07:17 Analysis of algorithms Computational complexity theory Susanne Albers Software optimization Cache Dagstuhl Best worst and average case Algorithm Analysis Locality of reference Computational geometry Paging
18	Sorting and Selection on Dynamic Data∗ Aris Anagnostopoulos† Ravi Kumar‡ Mohammad Mahdian‡ Add to Reading List Source URL: bioinfo.ict.ac.cn Language: English - Date: 2014-11-28 11:05:21 Analysis of algorithms Sorting algorithms Computational complexity theory Permutations Quicksort Science Selection algorithm FisherYates shuffle Algorithm Time complexity Sort Best worst and average case
19	CS264: Beyond Worst-Case Analysis Lecture #1: Three Motivating Examples∗ Tim Roughgarden† September 22, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-11-02 12:29:21 Computational complexity theory Analysis of algorithms Operations research Linear programming Convex optimization Algorithm Smoothed analysis Best worst and average case Time complexity Sorting algorithm Merge sort Simplex algorithm
20	Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗ Christoph Lenzen Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-05-29 10:12:02 Analysis of algorithms Balls into bins With high probability Sorting algorithm Leader election Time complexity Best worst and average case Big O notation Bin Iterated logarithm Randomized algorithm Asymptotically optimal algorithm

UPDATE